Application of the Nonlinear Steepest Descent Method to the Coupled Sasa-Satsuma Equation
نویسندگان
چکیده
منابع مشابه
Soliton approach to the noisy Burgers equation Steepest descent method
The noisy Burgers equation in one spatial dimension is analyzed by means of the Martin-SiggiaRose technique in functional form. In a canonical formulation the morphology and scaling behavior are accessed by mean of a principle of least action in the asymptotic non-perturbative weak noise limit. The ensuing coupled saddle point field equations for the local slope and noise fields, replacing the ...
متن کاملThe application of homotopy analysis method to solve a generalized Hirota–Satsuma coupled KdV equation
Here, an analytic technique, namely the homotopy analysis method (HAM), is applied to solve a generalized Hirota–Satsuma coupled KdV equation. HAM is a strong and easy-to-use analytic tool for nonlinear problems and dose not need small parameters in the equations. Comparison of the results with those of Adomian’s decomposition method (ADM) and homotopy perturbation method (HPM), has led us to s...
متن کاملThe unified transform method for the Sasa-Satsuma equation on the half-line.
We implement the unified transform method to the initial-boundary value (IBV) problem of the Sasa-Satsuma equation on the half line. In addition to presenting the basic Riemann-Hilbert formalism, which linearizes this IBV problem, we also analyse the associated general Dirichlet to Neumann map using the so-called global relation.
متن کاملOn the Steepest Descent Method for Matrix
We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...
متن کاملSteepest descent method for solving zero-one nonlinear programming problems
In this paper we use steepest descent method for solving zero-one nonlinear programming problem. Using penalty function we transform this problem to an unconstrained optimization problem and then by steepest descent method we obtain the original problem optimal solution. 2007 Elsevier Inc. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: East Asian Journal on Applied Mathematics
سال: 2021
ISSN: ['2079-7362', '2079-7370']
DOI: https://doi.org/10.4208/eajam.220920.250920